Anticancer Peptides Classification Using Kernel Sparse Representation Classifier
نویسندگان
چکیده
Cancer is one of the most challenging diseases because its complexity, variability, and diversity causes. It has been major research topics over past decades, yet it still poorly understood. To this end, multifaceted therapeutic frameworks are indispensable. Anticancer peptides (ACPs) promising treatment option, but their large-scale identification synthesis require reliable prediction methods, which a problem. In paper, we present an intuitive classification strategy that differs from traditional xmlns:xlink="http://www.w3.org/1999/xlink">black-box method based on well-known statistical theory xmlns:xlink="http://www.w3.org/1999/xlink">sparse-representation classification (SRC). Specifically, create over-complete dictionary matrices by embedding xmlns:xlink="http://www.w3.org/1999/xlink">composition K-spaced amino acid pairs (CKSAAP). Unlike SRC frameworks, use efficient xmlns:xlink="http://www.w3.org/1999/xlink">matching pursuit solver instead computationally expensive xmlns:xlink="http://www.w3.org/1999/xlink">basis in strategy. Furthermore, xmlns:xlink="http://www.w3.org/1999/xlink">kernel principal component analysis (KPCA) employed to cope with non-linearity dimension reduction feature space whereas xmlns:xlink="http://www.w3.org/1999/xlink">synthetic minority oversampling technique (SMOTE) used balance dictionary. The proposed evaluated two benchmark datasets for parameters found outperform existing methods. results show highest sensitivity balanced accuracy, might be beneficial understanding structural chemical aspects developing new ACPs. Google-Colab implementation available GitHub page (https://github.com/ehtisham-Fazal/ACP-Kernel-SRC).
منابع مشابه
Kernel sparse representation based classification
Sparse representation has attracted great attention in the past few years. Sparse representation based classification (SRC) algorithm was developed and successfully used for classification. In this paper, a kernel sparse representation based classification (KSRC) algorithm is proposed. Samples are mapped into a high dimensional feature space first and then SRC is performed in this new feature s...
متن کاملKernel sparse representation for time series classification
Article history: Received 12 February 2014 Received in revised form 13 August 2014 Accepted 29 August 2014 Available online 8 September 2014
متن کاملKernel L1-Minimization: Application to Kernel Sparse Representation Based Classification
The sparse representation based classification (SRC) was initially proposed for face recognition problems. However, SRC was found to excel in a variety of classification tasks. There have been many extensions to SRC, of which group SRC, kernel SRC being the prominent ones. Prior methods in kernel SRC used greedy methods like Orthogonal Matching Pursuit (OMP). It is well known that for solving a...
متن کاملRoad sign classification using Laplace kernel classifier
Driver support systems of intelligent vehicles will predict potentially dangerous situations in heavy traffic, help with navigation and vehicle guidance and interact with a human driver. Important information necessary for traffic situation understanding is presented by road signs. A new kernel rule has been developed for road sign classification using the Laplace probability density. Smoothing...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3246927